n,s = map(int,input().split())
a = list(map(int,input().split()))
l = 1
r = n
c = 0
ans = 0
while l <= r:
mid = l+((r-l)//2)
lis = [0] * n
for i in range(n):
lis[i] = a[i] + ((i+1)*mid)
lis.sort()
s1 = sum(lis[:mid])
if s1 <= s:
c = mid
l = mid + 1
ans = s1
else:
r = mid - 1
print(f"{c} {ans}")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll can(int k,ll a[])
{
ll sum=0;
for(int i=0;i<k;i++)
sum+=a[i];
return sum;
}
int main() {
// ios::sync_with_stdio(0);
//cin.tie(0);
int n,s;
cin>>n>>s;
ll elements[n],a[n];
for(int i=0;i<n;i++)
cin>>elements[i];
ll l=0,h=n,mid,res=0,m=0;
while(l<=h)
{
mid=(l+h)/2;
for(int i=0;i<n;i++) a[i]= elements[i]+(i+1)*mid;
sort(a,a+n);
ll sum=can(mid,a);
if(sum<=s)
{
res=sum;
l=mid+1;
m=mid;
}
else h=mid-1;
}
cout<<m<<' '<<res;
return 0;
}1670D - Very Suspicious | 1141B - Maximal Continuous Rest |
1341A - Nastya and Rice | 1133A - Middle of the Contest |
385A - Bear and Raspberry | 1311B - WeirdSort |
1713F - Lost Array | 236B - Easy Number Challenge |
275A - Lights Out | 147A - Punctuation |
253A - Boys and Girls | 1327E - Count The Blocks |
984A - Game | 12B - Correct Solution |
1355B - Young Explorers | 485A - Factory |
628A - Tennis Tournament | 1436B - Prime Square |
1707B - Difference Array | 1422C - Bargain |
1611F - ATM and Students | 660A - Co-prime Array |
1692F - 3SUM | 1470A - Strange Birthday Party |
190D - Non-Secret Cypher | 1721B - Deadly Laser |
1721C - Min-Max Array Transformation | 1721A - Image |
1180C - Valeriy and Deque | 557A - Ilya and Diplomas |